public class Solution111Test {
    public static int maxProduct(String[] words) {

        int lenArr = words.length;
        int lenMax = Integer.MIN_VALUE;
        int curlen = 0;
        for (int i = 0; i < lenArr - 1; i++) {
            char arri[] = words[i].toCharArray();
            int[] cnti = new int[26];
            for (char m : arri) {
                cnti[m - 'a']++;
            }

            for (int j = i + 1; j < lenArr; j++) {

                char arrj[] = words[j].toCharArray();
                int[] cntj = new int[26];
                for (char n : arrj) {
                    cntj[n - 'a']++;
                }
            }
        }
        return  0;
    }

    public static void main(String[] args) {
        String s1 = new String("HelloWorld");
        String s2 = new String("HelloWorldAreyouOK?");
        char[] s1ch = s1.toCharArray();
        char[] s2ch = s1.toCharArray();
        char sum =' ';
        for(char ch1 : s1ch)
        {
//            sum=sum^ch1;
//            字符可不能异或啊宝友
        }

        char a ='a';
        char b ='b';
        char c ='c';
        int ai =(1<<(a-'a'));
        int bi =(1<<(b-'a'));
        int ci =(1<<(c-'a'));
        int di =(1<<('d'-'a'));
        int ei =(1<<('e'-'a'));
        int xi =(1<<('x'-'a'));
        int yi =(1<<('y'-'a'));
//        int ci =(1<<(c-'a'));
//        int ci =(1<<(c-'a'));
//        int ci =(1<<(c-'a'));
        System.out.println(ai);
        System.out.println(bi);
        System.out.println(ci);
        System.out.println(di);
        System.out.println(ei);
        System.out.println(xi);
        System.out.println(yi);

        int aih =1|(1<<(a-'a'));
        int bih =1|(1<<(b-'a'));
        int cih =1|(1<<(c-'a'));
        int dih =1|(1<<('d'-'a'));
        int eih =1|(1<<('e'-'a'));
        int xih =1|(1<<('x'-'a'));
        int yih =1|(1<<('y'-'a'));

        aih |=(1<<(a-'a'));
         bih |=(1<<(b-'a'));
         cih |=(1<<(c-'a'));
         dih |=(1<<('d'-'a'));
        eih |=(1<<('e'-'a'));
         xih |=(1<<('x'-'a'));
         yih |=(1<<('y'-'a'));

        System.out.println(aih);
        System.out.println(bih);
        System.out.println(cih);

        System.out.println(dih);
        System.out.println(eih);

        System.out.println(xih);
        System.out.println(yih);

        System.out.println();
        System.out.println();
        System.out.println();
        int num = 0|2;
        int num1 = 0&2;
        int num2 = 0^2;

        System.out.println(num);
        System.out.println(num1);
        System.out.println(num2);
    }
}
//转换成两个字符串数组，两重for循环遍历 每一个与数组中的异或，异或之后看